Algorithmic Techniques for Geometric Optimization
نویسندگان
چکیده
We review the recent progress in the design of e cient algorithms for various problems in geometric optimization. The emphasis in this survey is on the techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear programming and related problems, and LP-type problems and their e cient solution.
منابع مشابه
A survey on Mesh Segmentation Techniques
We present a review of the state of the art of segmentation and partitioning techniques of boundary meshes. Recently, these have become a part of many mesh and object manipulation algorithms in computer graphics, geometric modelling and computer aided design. We formulate the segmentation problem as an optimization problem and identify two primarily distinct types of mesh segmentation, namely p...
متن کاملSpaces of Curves, Dynamical Contours and Localization in Computer Vision
Using techniques from computational differential geometry, we present a new approach to the algorithmic study of planar curves, with applications to shape and image analysis. The main idea is to construct spaces of curves satisfying constraints suited to specific problems and exploit the geometric structure of these spaces to quantify and analyze properties of contours and solve optimization an...
متن کاملComputational fluid dynamics analysis and geometric optimization of solar chimney power plants by using of genetic algorithm
In this paper, a multi-objective optimization method is implemented by using of genetic algorithm techniques in order to determine optimum configuration of solar chimney power plant. The objective function which is simultaneously considered in the analysis is output power of the plant. Output power of the system is maximized. Design parameters of the considered plant include collector radius (R...
متن کاملImproved Local Search for Geometric Hitting Set
Over the past several decades there has been steady progress towards the goal of polynomial-time approximation schemes (PTAS) for fundamental geometric combinatorial optimization problems. A foremost example is the geometric hitting set problem: given a set P of points and a set D of geometric objects, compute the minimum-sized subset of P that hits all objects in D. For the case where D is a s...
متن کاملOptimal production and marketing planning with geometric programming approach
One of the primary assumptions in most optimal pricing methods is that the production cost is a non-increasing function of lot-size. This assumption does not hold for many real-world applications since the cost of unit production may have non-increasing trend up to a certain level and then it starts to increase for many reasons such as an increase in wages, depreciation, etc. Moreover, the prod...
متن کامل